A Partial Approach to Model Checking

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Partial Approach to Model Checking ∗ ( Extended

This paper presents a model-checking method for linear-time temporal logic that avoids the state explosion due to the modelling of concurrency by interleaving. The method relies on the concept of Mazurkiewicz’s trace as a semantic basis and uses automata-theoretic techniques, including automata that operate on words of ordinality higher than ω.

متن کامل

A Partial Approach to Model Checking

This paper presents a model-checking method for linear-time temporal logic that can avoid most of the state explosion due to the modelling of concurrency by interleaving. The method relies on the concept of Mazurkiewicz’s trace as a semantic basis and uses automata-theoretic techniques, including automata that operate on words of ordinality higher than ω.

متن کامل

Unfoldings a Partial-order Approach to Model Checking Springer

The design and analysis of concurrent systems has proved to be one of the most vexing practical problems in computer science. We need such systems if we want to compute at high speed and yet distribute the computation over distances too long to allow synchronizing communication to a global clock. At the speed of modern computer systems, one centimeter is already a long distance for synchronizat...

متن کامل

A Partial Order Approach to Branching Time Logic Model Checking

Part.ial order t.echniques enable reducing the size of I.Iw sl,ate gtoaph used for model checking, thus alleviating the 'state space explosion' problem. Tilt'sf.' reductions are based on selecting a subset of the enabled operations from each program 51.ale. So far. these methods have been studied, implemel~ted and demonst.rat.ed fol' assertional langllagcs t.hat. model t.he executions of a prog...

متن کامل

Unfoldings - A Partial-Order Approach to Model Checking

The design and analysis of concurrent systems has proved to be one of the most vexing practical problems in computer science. We need such systems if we want to compute at high speed and yet distribute the computation over distances too long to allow synchronizing communication to a global clock. At the speed of modern computer systems, one centimeter is already a long distance for synchronizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1994

ISSN: 0890-5401

DOI: 10.1006/inco.1994.1035